Inbound Carrier Plan Optimization for Adaptive VSAT Networks

نویسندگان

چکیده

The past decades witnessed the application of adaptive coding and modulation (ACM) in satellite links. However, ACM technologies come at cost higher complexity when designing network's carrier plan user terminals. Accounting for those issues is even more important link uses frequencies Ka band above, where attenuation caused by tropospheric phenomena a major concern. In this paper, we propose solution inbound, i.e., return link, sizing very small aperture terminal (VSAT) networks. As key factor, present mathematical problem formulation based on spatially correlated time series. Our proposed scheme formulated as mixed integer linear programming (MILP) optimization problem. The numerical results test scenario Europe show 10 to 50% bandwidth improvement over traditional methods outage probabilities lower than 1%.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Next Generation Multiservice Vsat Networks

Very Small Aperture Terminal (VSAT) satellite networks have so far been successful in the provision of specific communication services to geographically dispersed users. However, user demands are becoming more complex, and VSAT networks are expected to provide a much wider range of services (voice, data and multimedia). We investigate how this service integration could be achieved and show that...

متن کامل

Service Integration in next Generation Vsat Networks

Very Small Aperture Terminal (VSAT) satellite networks have so far been successful in the provision of specific communication services to geographically dispersed users. However, user demands are becoming more complex, and VSAT networks are expected to provide a much wider range of services (voice, data and multimedia). We investigate how this service integration could be achieved and show that...

متن کامل

Distributed Optimization in Adaptive Networks

We develop a protocol for optimizing dynamic behavior of a network of simple electronic components, such as a sensor network, an ad hoc network of mobile devices, or a network of communication switches. This protocol requires only local communication and simple computations which are distributed among devices. The protocol is scalable to large networks. As a motivating example, we discuss a pro...

متن کامل

Plan Optimization by Plan Rewriting

Planning by Rewriting (PbR) is a paradigm for efficient high-quality planning that exploits declarative plan rewriting rules and efficient local search techniques to transform an easy-to-generate, but possibly suboptimal, initial plan into a high-quality plan. In addition to addressing planning efficiency and plan quality, PbR offers a new anytime planning algorithm. The plan rewriting rules ca...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Aerospace and Electronic Systems

سال: 2022

ISSN: ['1557-9603', '0018-9251', '2371-9877']

DOI: https://doi.org/10.1109/taes.2022.3194502